AKÇADAĞ KADI İBRAHİM KÖYÜ CAMİSİ’NİN MİMARİSİ VE TARİHLENDİRİLMESİ
نویسندگان
چکیده
منابع مشابه
Daniel Meneveaux , Eric Maisel and Kadi Bouatouch
Computing global illumination in a moderate time for complex environments and walking through them is one of the challenges in computer graphics. To meet this goal, a prepro-cessing is necessary. This preprocessing consists in partitioning the environment into cells and determining visibility between these cells. Most of the existing partitioning methods rely on the Binary Space Partitioning te...
متن کاملVE - cadherin trans - interaction
Correspondence to Asrar B. Malik: [email protected]; or Yulia A. Komarova: [email protected] Abbreviations used in this paper: AJ, adherens junction; CMV, cytomegalovirus; cRO, caged Rockout; DN, dominant negative; FRET, Förster resonance energy transfer; GAP, GTPase-activating protein; HMEC, human dermal microvascular endothelial cell; MLCII, myosin-II light chain; NMR, nuclear magnetic resonance...
متن کاملYazilim Muhendisligi Alaninda Yayimlanan Tez ve Makalelerin SWEBOK a gore Degerlendirilmesi ve Yazilim Muhendisligi Egitimi ve Projelerinin Iyilestirilmesi icin Oneriler
Özet. Yazılım Mühendisliği (YM) için rehber niteliğini taşıyan SWEBOK kılavuzunda YM’nde yürütülen faaliyetler 15 bilgi alanı altında toplanmıştır. Bu çalışmamızın amacı; SWEBOK’da belirtilen bu alanlarda yapılan yayınların niceliklerini inceleyerek YM ile ilgili bilgi birikiminin hangi YM alanlarında yoğunlaştığını ve hangi alanların ise daha çok araştırılmaya muhtaç olduğunu tespit etmektir. ...
متن کاملOn ev-degree and ve-degree topological indices
Recently two new degree concepts have been defined in graph theory: ev-degree and ve-degree. Also the evdegree and ve-degree Zagreb and Randić indices have been defined very recently as parallel of the classical definitions of Zagreb and Randić indices. It was shown that ev-degree and ve-degree topological indices can be used as possible tools in QSPR researches . In this paper we d...
متن کاملMemory Management Schemes for Radiosity Computation in Complex Environments Daniel Meneveaux, Kadi Bouatouch and Eric Maisel
Hierarchical radiosity is a very demanding process in terms of computation time and memory ressources even for scenes of moderate complexity. To handle complex environments, not tting in memory, new solutions have to be devised. One solution is to partition the scene into subsets of polygons (3D cells or clusters) and to maintain in memory only some of them. The radiosity computation is perform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of History School
سال: 2021
ISSN: 1308-5298
DOI: 10.29228/joh.49553